Representable Lexicographic Products
نویسنده
چکیده
A linear ordering is said to be representable if it can be order-embedded into the reals. Representable linear orderings have been characterized as those which are separable in the order topology and have at most countably many jumps. We use this characterization to study the representability of a lexicographic product of linear orderings. First we count the jumps in a lexicographic product in terms of the number of jumps in its factors. Then we relate the separability of a lexicographic product to properties of its factors, and derive a classification of representable lexicographic products. Mathematics Subject Classifications (2000): Primary 06A05; Secondary 06F30, 54F05, 91B16.
منابع مشابه
On Lexicographic Products of Two Fuzzy Graphs
Abstract. In this paper, lexicographic products of two fuzzy graphs namely, lexicographic min-product and lexicographic max-product which are analogous to the concept lexicographic product in crisp graph theory are defined. It is illustrated that the operations lexicographic products are not commutative. The connected, effective and complete properties of the operations lexicographic products a...
متن کاملAnswers to Two Questions of Fishburn on Subset Comparisons in Comparative Probability Orderings
We show that every additively representable comparative probability ordering is determined by at least n− 1 binary subset comparisons. We show that there are many orderings of this kind, not just the lexicographic ordering. These results provide answers to two questions asked by Fishburn.
متن کاملAxiomatizing the lexicographic products of modal logics with linear temporal logic
Given modal logics 1, 2, their lexicographic product 1 ⇤ 2 is a new logic whose frames are the Cartesian products of a 1-frame and a 2-frame, but with the new accessibility relations reminiscent of a lexicographic ordering. This article considers the lexicographic products of several modal logics with linear temporal logic (LTL) based on “next” and “always in the future”. We provide axiomatizat...
متن کاملLexicographic semigroupoids
The natural lexicographic semigroupoids associated with Cantor product spaces indexed by countable linear orders are classified. Applications are given to the classification of triangular operator algebras which are direct limits of upper-triangular matrix algebras. 0. Introduction Consider a Cantor space which is presented explicitly as an infinite product of finite topological spaces. The pro...
متن کامل1-Planar Lexicographic Products of Graphs
A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar lexicographic products. Mathematics Subject Classification: 05C10, 05C62, 05C76
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 21 شماره
صفحات -
تاریخ انتشار 2004